Rethinking Chosen-Ciphertext Security under Kerckhoffs' Assumption

Any software claiming to cryptographically protect the data should use an encryption algorithm that meets public standards, and has an extensive history of independent cryptanalytic validation. However, even though they encrypt with strong encryption algorithm, most existing public-key cryptosystems, including RSA-OAEP, do not consider the “memory reconstruction attack” or the “memory core-dump attack” mounted by computer forensic software, information stealing viruses, or other accidental reasons. To deal with this situation, this paper attempts to analyze the existing provably secure cryptosystems under “Kerckhoffs’ assumption” : an attacker knows all details of the cryptosystem except the key information, which security consequently rests entirely upon.